Bounding the inefficiency of logit-based stochastic user equilibrium
نویسندگان
چکیده
منابع مشابه
Bounding the inefficiency of logit-based stochastic user equilibrium
Bounding the inefficiency of selfish routing has become an emerging research subject. A central result obtained in the literature is that the inefficiency of deterministic User Equilibrium (UE) is bounded and the bound is independent of network topology. This paper makes a contribution to the literature by bounding the inefficiency of the logit-based Stochastic User Equilibrium (SUE). In a stoc...
متن کاملToll pricing framework under logit-based stochastic user equilibrium constraints
This paper addresses the toll pricing framework for the first-best pricing with logit-based stochastic user equilibrium (SUE) constraints. The first-best pricing is usually known as marginal-cost toll, which can be obtained by solving a traffic assignment problem based on the marginal cost functions. The marginal-cost toll, however, has rarely been implemented in practice, because it requires e...
متن کاملA Path-Based Algorithm for the Cross-Nested Logit Stochastic User Equilibrium Traffic Assignment
This paper investigates the single-class static stochastic user equilibrium (SUE) problem with separable and additive link costs. A SUE assignment based on the Cross-Nested Logit (CNL) route choice model is presented. The CNL model can better represent route choice behavior compared to the Multinomial Logit (MNL) model, while keeping a closed form equation. The paper uses a specific optimizatio...
متن کاملBounding the Inefficiency of Compromise
Social networks on the Internet have seen an enormous growth recently and play a crucial role in different aspects of today’s life. They have facilitated information dissemination in ways that have been beneficial for their users but they are often used strategically in order to spread information that only serves the objectives of particular users. These properties have inspired a revision of ...
متن کاملComputation and application of the paired combinatorial logit stochastic user equilibrium problem
The paired combinatorial logit (PCL) model is one of the recent extended logit models adapted to resolve the overlapping problem in the route choice problem, while keeping the analytical tractability of the logit choice probability function. However, the development of efficient algorithms for solving the PCL model under congested and realistic networks is quite challenging, since it has large-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2010
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2009.03.023